Eecient Validation of Matching Hypotheses Using Mahalanobis Distance

The validation of matching hypotheses using Mahalanobis distance is extensively utilized in robotic applications, and in general data-association techniques. The Ma-halanobis distance, deened by t h e i n n o vation and its covariance, is compared with a threshold deened by the chi-square distribution to validate a matching hypothesiss the validation test is a time-consuming operation. This paper presents an eecient computation for this test. The validation test implies a computational overhead for two reasons: rst, because of covariance matrix inversion, and second because the computation of the covariance and innovation terms are also expensive operations, in fact, more expensive than the inversion itself. The method described here can be summarized as an incremental, non-decreasing computation for the Mahalanobis distancee if the incrementally computed value exceeds the threshold then the computation is stopped. The elements of covariance and innovation, and the matrix inversion itself, are only computed if they are usedd progressivity is the major advantage of the method. The method is based upon the square-root-free Cholesky's factorization. In addition, a lower bound for the Mahalanobis distance is proposed. This lower bound has two advantages: it can be progressively computed, and it is greater than the classical trace lower bound.